<operating system, product> Novell's fully compatible alternative to MS-DOS. It is intended as an {operating system} for workstations on Novell networks. It features enhanced memory management that moves the operating system, network drivers, and memory-resident programs (TSRs) out of conventional memory on all systems with an Intel 80286 or later processor and extended memory or expanded memory. It supports preemptive multitasking and {peer-to-peer networking} using the same DOS Requester and VLMs for a "common client" with native Novell NetWare. A data compression utility effectively doubles storage capacity of the hard disk. It supports disk defragmentation, a read/write disk cache for better performance of both DOS and Microsoft Windows {application programs}. An undelete utility recovers erased files, even on network drives. It has a complete on-line reference guide, command help, and menu-driven install and setup utilities for easy configuration changes. Novell DOS has internal and external commands like MS-DOS. The following commands have been significantly enhanced in Novell DOS: CHKDSK, DISKCOPY, HELP, MEM, REPLACE, UNDELETE, and XCOPY. Novell DOS also includes many new commands such as XDIR, CURSOR, XDEL, TOUCH, SCRIPT, and RENDIR. Version: 7. (1995-04-14)

<games> An algorithm for choosing the next move in a two player game. A player moves so as to maximise the minimum value of his opponent's possible following moves. If it is my turn to move, I give a value to each legal move I might make. If the result of a move is an immediate win for me I give it positive infinity and, if it is an immediate win for you, negative infinity. The value to me of any other move is the minimum of the values resulting from each of your possible replies. The above algorithm will give every move a value of positive or negative infinity since the value of every move will be the value of some final winning or losing move. This can be extended if we can supply a heuristic evaluation function which gives values to non-final game states without considering all possible following complete sequences. We can then limit the minimax algorithm to look only a certain number of moves ahead. This number is called the "look-ahead" or "ply". See also alpha/beta pruning. [Is "maximin" used? Is it significantly different?] (2000-12-07)